Markov speckle for efficient random bit generation.

نویسندگان

  • Roarke Horstmeyer
  • Richard Y Chen
  • Benjamin Judkewitz
  • Changhuei Yang
چکیده

Optical speckle is commonly observed in measurements using coherent radiation. While lacking experimental validation, previous work has often assumed that speckle's random spatial pattern follows a Markov process. Here, we present a derivation and experimental confirmation of conditions under which this assumption holds true. We demonstrate that a detected speckle field can be designed to obey the first-order Markov property by using a Cauchy attenuation mask to modulate scattered light. Creating Markov speckle enables the development of more accurate and efficient image post-processing algorithms, with applications including improved de-noising, segmentation and super-resolution. To show its versatility, we use the Cauchy mask to maximize the entropy of a detected speckle field with fixed average speckle size, allowing cryptographic applications to extract a maximum number of useful random bits from speckle images.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The entropy of keys derived from laser speckle

Laser speckle has been proposed in a number of papers as a high-entropy source of unpredictable bits for use in security applications. Bit strings derived from speckle can be used for a variety of security purposes such as identification, authentication, anti-counterfeiting, secure key storage, random number generation and tamper protection. The choice of laser speckle as a source of random key...

متن کامل

Efficient Generation \epsilon-close to G(n,p) and Generalizations

We give an efficient algorithm to generate a graph from a distribution ǫ-close to G(n, p), in the sense of total variation distance. In particular, if p is represented with O(log n)-bit accuracy, then, with high probability, the running time is linear in the expected number of edges of the output graph (up to poly-logarithmic factors). All our running times include the complexity of the arithme...

متن کامل

Recognition of Changes in SAR Images Based on Gauss-Log Ratio and MRFFCM

A modified version of MRFFCM (Markov Random Field Fuzzy C means) based SAR (Synthetic aperture Radar) image change detection method is proposed in this paper. It involves three steps: Difference Image (DI) generation by using Gauss-log ratio operator, speckle noise reduction by SRAD (Speckle Reducing Anisotropic Diffusion), and the detection of changed regions by using MRFFCM. The proposed meth...

متن کامل

Comparison of texture synthesis methods for content generation in ultrasound simulation for training

Navigation and interpretation of ultrasound (US) images require substantial expertise, the training of which can be aided by virtual-reality simulators. However, a major challenge in creating plausible simulated US images is the generation of realistic ultrasound speckle. Since typical ultrasound speckle exhibits many properties of Markov Random Fields, it is conceivable to use texture synthesi...

متن کامل

Microsoft Word - Burst-and-Random-Error-Code-Evaluation

Markov chains are a popular means to capture correlated random processes for characterization and analysis of error pattern or bursty traffic in data transmission. The performance evaluation of communication protocols based on Markov models is tractable with limited state space and often depends on efficient implementation. Simulation or other methods have to be adopted for system of higher com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Optics express

دوره 20 24  شماره 

صفحات  -

تاریخ انتشار 2012